- pairwise disjoint set
- n.两两不相交集
English-Chinese dictionary of mining (英汉矿业大词典). 2013.
pairwise disjoint set
Look at other dictionaries:
Set packing — is a classical NP complete problem in computational complexity theory and combinatorics, and was one of Karp s 21 NP complete problems. Suppose we have a finite set S and a list of subsets of S. Then, the set packing problem asks if some k… … Wikipedia
Disjoint sets — Two disjoint sets. In mathematics, two sets are said to be disjoint if they have no element in common. For example, {1, 2, 3} and {4, 5, 6} are disjoint sets.[1] Explanation Formally, two sets A and … Wikipedia
Disjoint union — In mathematics, the term disjoint union may refer to one of two different concepts: In set theory, a disjoint union (or discriminated union) is a modified union operation that indexes the elements according to which set they originated in;… … Wikipedia
Set cover problem — The set covering problem is a classical question in computer science and complexity theory. As input you are given several sets. They may have some elements in common. You must select a minimum number of these sets so that the sets you have… … Wikipedia
Vitali set — In mathematics, a Vitali set is an elementary example of a set of real numbers that is not Lebesgue measurable. The Vitali theorem is the existence theorem that there are such sets. It is a non constructive result. The naming is for Giuseppe… … Wikipedia
Dense set — In topology and related areas of mathematics, a subset A of a topological space X is called dense (in X) if any point x in X belongs to A or is a limit point of A.[1] Informally, for every point in X, the point is either in A or arbitrarily close … Wikipedia
Partition of a set — In mathematics, a partition of a set X is a division of X into non overlapping parts or blocks or cells that cover all of X . More formally, these cells are both collectively exhaustive and mutually exclusive with respect to the set being… … Wikipedia
Continuity set — In measure theory, a continuity set of a measure μ is any Borel set B such that The class of all continuity sets for given measure μ forms a ring.[1] Similarly, for a random variable X a set B is called continuity set if otherwise B is called the … Wikipedia
Ordered partition of a set — In combinatorial mathematics, an ordered partition O of a set S is a sequence A1, A2, A3, ..., An of subsets of S, with union is S, which are non empty, and pairwise disjoint. This differs from a partition of a set, in that the order of the Ai… … Wikipedia
Almost disjoint sets — In mathematics, two sets are almost disjoint if their intersection is small in some sense. Different definitions of small will therefore result in different definitions of almost disjoint . Definition The most common choice is to take small to… … Wikipedia
Schwartz set — In voting systems, the Schwartz set is the union of all Schwartz set components. A Schwartz set component is any non empty set S of candidates such that # Every candidate inside the set S is pairwise unbeaten by any candidate outside S ; and # No … Wikipedia
